Completely Reachable Automata
نویسندگان
چکیده
We present a few results and several open problems concerning complete deterministic finite automata in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word.
منابع مشابه
Symbolic reachable set computation of piecewise affine hybrid automata and its application to biological modelling: Delta-Notch protein signalling.
Hybrid automata are an eminently suitable modelling framework for biological protein regulatory networks, as the protein concentration dynamics inside each biological cell are modelled using linear differential equations; inputs activate or deactivate these continuous dynamics through discrete switches, which themselves are controlled by protein concentrations reaching given thresholds. This pa...
متن کاملOn the interplay between Babai and \v{C}ern\'y's conjectures
Motivated by the Babai conjecture and the Černý conjecture, we study the reset thresholds of automata with the transition monoid equal to the full monoid of transformations of the state set. For automata with n states in this class, we prove that the reset thresholds are upperbounded by 2n − 6n + 5 and can attain the value n(n−1) 2 . In addition, we study diameters of the pair digraphs of permu...
متن کاملDirectable Fuzzy and Nondeterministic Automata
We study three notions of directability of fuzzy automata akin to the D1-, D2and D3-directability of nondeterministic automata. Thus an input word w of a fuzzy automaton is D1-directing if a fixed single state is reachable by w from all states, D2-directing if exactly the same states are reachable by w from every state, and D3-directing if there is a state reachable by w from every state. We st...
متن کاملFirst-Order Logic on CPDA Graphs
We contribute to the question about decidability of firstorder logic on configuration graphs of collapsible pushdown automata. Our first result is decidability of existential FO sentences on configuration graphs (and their ε-closures) of collapsible pushdown automata of order 3, restricted to reachable configurations. Our second result is undecidability of whole first-order logic on configurati...
متن کاملReachability Verification for Hybrid Automata
We study the reachability problem for hybrid automata. Automatic approaches, which attempt to construct the reachable region by symbolic execution, often do not terminate. In these cases, we require the user to guess the reachable region, and we use a theorem prover (Pvs) to verify the guess. We classify hybrid automata according to the theory in which their reachable region can be deened nitel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016